Another Characterization of Trees
نویسنده
چکیده
It is proved that a continuum is a tree if and only if each two connected subsets meet in a connected set. In this note a continuum is a compact connected Hausdorff space. A tree is a continuum in which distinct points are never conjugate [6], i.e., any two distinct points are separated by the deletion of some third point. A dendrite is a metrizable tree. The literature is replete with characterizations of dendrites, but it is frequently the case that these characterizations are invalid for trees. Recently the author [5] has observed that if F is a property which characterizes dendrites among metrizable continua, then it is often the case that an arbitrary continuum is a tree if and only if it satisfies P hereditarily, i.e., if every subcontinuum satisfies P. Therefore one can expect that a property which characterizes dendrites among metrizable continua, and which is intrinsically hereditary, will also characterize trees. To this end let us consider the "connected intersection property." A connected space satisfies the connected intersection property if the intersection of any two of its connected sets is connected. It is obvious that this property is hereditary, and it is known [6] that a metrizable continuum is a dendrite if and only if it satisfies the connected intersection property. The author knows of no published proof which is not highly metric in nature, i.e., in which the second countability of the continuum is employed in a crucial way so that there is no hope of a direct generalization to arbitrary continua. It is the purpose of this note to provide a new proof, valid in the nonmetrizable case. It should be noted that the connected intersection property has been studied in general connected spaces by Whyburn [7] and Kok [3], especially in the locally connected case. Whyburn first proved that in a locally connected, connected Hausdorff space distinct points are never conjugate if and only if the space satisfies the connected intersection property. It is curious that the compact, nonlocally connected case has not been considered. The main difficulty Received by the editors August 21, 1989 and, in revised form, February 22, 1990. 1980 Mathematics Subject Classification (1985 Revision). Primary 54F20, 54F50, 54F65.
منابع مشابه
A characterization relating domination, semitotal domination and total Roman domination in trees
A total Roman dominating function on a graph $G$ is a function $f: V(G) rightarrow {0,1,2}$ such that for every vertex $vin V(G)$ with $f(v)=0$ there exists a vertex $uin V(G)$ adjacent to $v$ with $f(u)=2$, and the subgraph induced by the set ${xin V(G): f(x)geq 1}$ has no isolated vertices. The total Roman domination number of $G$, denoted $gamma_{tR}(G)$, is the minimum weight $omega(f)=sum_...
متن کاملIsolation and molecular characterization of Cryptococcus species isolated from pigeon nests and Eucalyptus trees
Background and Purpose: Cryptococcus species are pathogenic and non-pathogenic basidiomycete yeasts that are found widely in the environment. Based on phenotypic methods, this genus has many species; however, its taxonomy is presently being re- evaluated by modern techniques. The Cryptococcus species complex includes two sibling taxa of Cryptococcus neoformans and Cryptococcus gattii. We aimed ...
متن کاملA characterization of trees with equal Roman 2-domination and Roman domination numbers
Given a graph $G=(V,E)$ and a vertex $v in V$, by $N(v)$ we represent the open neighbourhood of $v$. Let $f:Vrightarrow {0,1,2}$ be a function on $G$. The weight of $f$ is $omega(f)=sum_{vin V}f(v)$ and let $V_i={vin V colon f(v)=i}$, for $i=0,1,2$. The function $f$ is said to bebegin{itemize}item a Roman ${2}$-dominating function, if for every vertex $vin V_0$, $sum_{uin N(v)}f(u)geq 2$. The R...
متن کاملIsolation and Characterization of Brenneria nigrifluens Causing Bacterial Shallow Bark Canker of Walnut Trees in Golestan Province, Iran
Shallow bark canker incited by Brenneria nigrifluens is considered one of the most dangerous diseases which can cause a significant reduction in walnut and timber production. During spring and summer of 2019, walnut gardens were surveyed for symptoms like leaf spot, fruit, and stem canker from four different regions of Golestan province located in Iran. A set of 11 Gram-negative bacteria were ...
متن کاملThe Subtree Size Profile of Bucket Recursive Trees
Kazemi (2014) introduced a new version of bucket recursive trees as another generalization of recursive trees where buckets have variable capacities. In this paper, we get the $p$-th factorial moments of the random variable $S_{n,1}$ which counts the number of subtrees size-1 profile (leaves) and show a phase change of this random variable. These can be obtained by solving a first order partial...
متن کاملRoman domination excellent graphs: trees
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010